A New Algorithm to Solve the Generalized Nash Equilibrium Problem
نویسندگان
چکیده
منابع مشابه
A Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملA generalized Nash equilibrium for a bioeconomic problem of fishing
With the overexploitation of many conventional fish stocks, and growing interest in harvesting new kinds of food from the sea, there is an increasing need for managers of fisheries to take account of interactions among species. In this work we define a bioeconomic equilibrium model for ’n’ fishermen who catch three species; these species compete with each other for space or food. The natural gr...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملSC 1 optimization reformulations of the generalized Nash equilibrium problem
The generalized Nash equilibrium problem is a Nash game which, in contrast to the standard Nash equilibrium problem, allows the strategy sets of each player to depend on the decision variables of all other players. It was recently shown by the authors that this generalized Nash equilibrium problem can be reformulated as both an unconstrained and a constrained optimization problem with continuou...
متن کاملA numerical algorithm for finding solutions of a generalized Nash equilibrium problem
A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2020
ISSN: 1563-5147,1024-123X
DOI: 10.1155/2020/1073412